Certificates of linear mixed integer infeasibility
نویسندگان
چکیده
منابع مشابه
Certificates of linear mixed integer infeasibility
A central result in the theory of integer optimization states that a system of linear diophantine equations Ax = b has no integral solution if and only if there exists a vector in the dual lattice, yT A integral such that yT b is fractional. We extend this result to systems that both have equations and inequalities {Ax = b, Cx ≤ d}. We show that a certificate of integral infeasibility is a line...
متن کاملInfeasibility Certificates for linear matrix inequalities
Farkas’ lemma is a fundamental result from linear programming providing linear certificates for infeasibility of systems of linear inequalities. In semidefinite programming, such linear certificates only exist for strongly infeasible linear matrix inequalities. We provide nonlinear algebraic certificates for all infeasible linear matrix inequalities in the spirit of real algebraic geometry. Mor...
متن کاملExact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
We describe simple and exact duals, and certificates of infeasibility and weak infeasibility in conic linear programming which do not rely on any constraint qualification, and retain most of the simplicity of the Lagrange dual. In particular, some of our infeasibility certificates generalize the row echelon form of a linear system of equations, and the “easy” proofs – as sufficiency of a certif...
متن کاملA generalization of the integer linear infeasibility problem
Does a given system of linear equations Ax = b have a nonnegative integer solution? This is a fundamental question in many areas, such as operations research, number theory, and statistics. In terms of optimization, this is called an integer feasibility problem. A generalized integer feasibility problem is to find b such that there does not exist a nonnegative integral solution in the system wi...
متن کاملCertificates of infeasibility via nonsmooth optimization
An important aspect in the solution process of constraint satisfaction problems is to identify exclusion boxes which are boxes that do not contain feasible points. This paper presents a certificate of infeasibility for finding such boxes by solving a linearly constrained nonsmooth optimization problem. Furthermore, the constructed certificate can be used to enlarge an exclusion box by solving a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2008
ISSN: 0167-6377
DOI: 10.1016/j.orl.2008.08.003